Quantum Annealing for Constrained Optimization
نویسندگان
چکیده
منابع مشابه
Simulated annealing for constrained global optimization
Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be noneonvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generat...
متن کاملOptimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of the algorithm is to generate feasible solutions of certain prescribed quality using an average time of the same order of magnitude as that spent by the original CSA with an optimal cooling schedule in generating a solutio...
متن کاملQuantum annealing in a kinetically constrained system.
Classical and quantum annealing is discussed in the case of a generalized kinetically constrained model, where the relaxation dynamics of a system with trivial ground state is retarded by the appearance of energy barriers in the relaxation path, following a local kinetic rule. Effectiveness of thermal and quantum fluctuations in overcoming these kinetic barriers to reach the ground state are st...
متن کاملA Dual Sequence Simulated Annealing Algorithm for Constrained Optimization
We propose a dual sequence Simulated Annealing algorithm, DSAC, for solving constrained optimization problems. This approach eliminates the need for imposing penalties in the objective function by tracing feasible and infeasible solution sequences independently. We compare DSAC with a similar single sequence algorithm, PSAC, where the objective function is augmented by various penalty forms rel...
متن کاملSimulated annealing with asymptotic convergence for nonlinear constrained optimization
In this paper, we present constrained simulated annealing (CSA), an algorithm that extends conventional simulated annealing to look for constrained local minima of nonlinear constrained optimization problems. The algorithm is based on the theory of extended saddle points (ESPs) that shows the one-to-one correspondence between a constrained local minimum and anESP of the corresponding penalty fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Applied
سال: 2016
ISSN: 2331-7019
DOI: 10.1103/physrevapplied.5.034007